Universal Variable-to-Fixed Length Codes Achieving Optimum Large Deviations Performance for Empirical Compression Ratio
نویسنده
چکیده
This paper clari es two variable-toxed length codes which achieve optimum large deviations performance of empirical compression ratio. One is Lempel-Ziv code with xed number of phrases, and the other is an arithmetic code with xed codeword length. It is shown that Lempel-Ziv code is asymptotically optimum in the above sense, for the class of nite-alphabet and nite-state sources, and that the arithmetic code is asymptotically optimum for the class of nite-alphabet uni lar sources. key words: source coding, variable-toxed length code, empirical compression rate, nite state source
منابع مشابه
Variable-to-fixed length codes provide better large deviations performance than fixed-to-variable length codes
It is proved that for finite-alphabet, finite-state unifilar sources, variable-to-fixed length codes provide better large deviations performance of the empirical compression ratio, than fixed-to-variable Manuscript received March 21, 1990; revised March 6, 1991. N. Merhav was with AT&T Bell Laboratories, Murray Hill, NJ. He is now with the Department of Electrical Engineering, Technion-Israel I...
متن کاملUniversal coding with minimum probability of codeword length overflow
-Lossless block-to-variable length source coding is studied for finite-state, finite-alphabet sources. We aim to minimize the probability that the normalized length of the codeword will exceed a given threshold B, subject to the Kraft inequality. It is shown that the Lempel-Ziv (LZ) algorithm asymptotically attains the optimal performance in the sense just defined, independently of the source a...
متن کاملSource coding exponents for zero-delay coding with finite memory
Fundamental limits on the source coding exponents (or large deviations performance) of zero-delay finite-memory (ZDFM) lossy source codes are studied. Our main results are the following. For any memoryless source, a suitably designed encoder that time-shares (at most two) memoryless scalar quantizers is as good as any time-varying fixed-rate ZDFM code, in that it can achieve the fastest exponen...
متن کاملA Fixed-Length Coding Algorithm for DNA Sequence Compression
Summary: While achieving a compression ratio of 2.0 bits/base ,the new algorithm codes non-N bases1 in fixed length.It dramatically reduces the time of coding and decoding than previous DNA compression algorithms and some universal compression programs. Availability: http://grandlab.cer.net/topic.php?TopicID=50 Contact: [email protected] [email protected] [email protected]
متن کاملUniversal variable-to-fixed length source codes
A universal variable-to-fixed length algorithm for binary memoryless sources which converges to the entropy of the source at the optimal rate is known. We study the problem of universal variable-to-fixed length coding for the class of Markov sources with finite alphabets. We give an upper bound on the performance of the code for large dictionary sizes and show that the code is optimal in the se...
متن کامل